es:ES, A, B:Type. (A r B)  (AbsInterface(A) r AbsInterface(B)) 

latex

Definitions

s = t, t  T, x:AB(x), x:A. B(x), EState(T), a:A fp B(a), f(a), Id, , strong-subtype(A;B), P  Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List, , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e', , b, constant_function(f;A;B), SWellFounded(R(x;y)), , pred!(e;e'), x,y. t(x;y), Void, x:A.B(x), Top, S  T, suptype(S; T), first(e), A, <a, b>, pred(e), x.A(x), x. t(x), P & Q, ES, P  Q, P  Q, f  g, f(x)?z, loc(e), vartype(i;x), state@i, State(ds), State(ds), x  dom(f), False, {T}, {x:A| B(x)} , let x,y = A in B(x;y), E, AbsInterface(A), True, T, (x  l)

Lemmas

es-interface wf, squash wf, true wf, subtype rel function, es-E wf, event system wf, subtype rel sum, deq wf, EOrderAxioms wf, kind wf, Msg wf, nat wf, val-axiom wf, cless wf, qle wf, bool wf, Knd wf, kindcase wf, IdLnk wf, constant function wf, loc wf, not wf, assert wf, first wf, top wf, unit wf, pred! wf, strongwellfounded wf, member wf, rationals wf, Id wf, EState wf, subtype rel wf